package com.example.leetcode.dp;

import com.example.leetcode.dp.common.DPUtils;

class Solution62 {
    public int uniquePaths(int m, int n) {
        // 回溯递归会超时
//        return BackTraceUtils.uniquePaths(m,n);
        return DPUtils.uniquePaths(m,n);
    }
}

public class leetcode62 {
    public static void main(String[] args) {
        Solution62 solution62 = new Solution62();
        System.out.println(solution62.uniquePaths(3, 7));
        System.out.println(solution62.uniquePaths(51, 9)); // 结果是19亿多
    }
}
